
import java.util.Random;

// to represent edges used in the initialization of the graph
public class Edge {

    // this denotes the first node on this edge
    Node first;
    // this denotes the second node on this edge
    Node second;
    // the Edge is given a weight which helps implement
    // Kruskal's algorithm. It has no effect on map traversal
    int weight;
    // this denotes whether this edge is vertical or horizontal
    String direction;
    
    // default constructor
    Edge(Node first, Node second, String direction) {
        Random rand = new Random();
        this.first = first;
        this.second = second;
        this.weight = rand.nextInt(100);
        this.direction = direction;
    }
    
    // constructor used for testing
    Edge(Node first, Node second, int weight, String direction) {
        this.first = first;
        this.second = second;
        this.weight = weight;
        this.direction = direction;
    }


}
